Utility Optimal Coding for Packet Transmission\ud over Wireless Networks – Part II:\ud Networks of Packet Erasure Channels

摘要

We define a class of multi–hop erasure networks that\udapproximates a wireless multi–hop network. The network carries\udunicast flows for multiple users, and each information packet\udwithin a flow is required to be decoded at the flow destination\udwithin a specified delay deadline. The allocation of coding rates\udamongst flows/users is constrained by network capacity. We\udpropose a proportional fair transmission scheme that maximises\udthe sum utility of flow throughputs. This is achieved by jointly\udoptimising the packet coding rates and the allocation of bits of\udcoded packets across transmission slots.